Relation between Production Capacity and Variety of Products on a Scheduling with Perishable Items for Minimizing the Sum of Earliness and Tardiness

نویسندگان

  • Shimpei Matsumoto
  • Tomoko Kashima
  • Hiroaki Ishii
  • H. ISHII
چکیده

This paper addresses a practical scheduling problem with perishable items as an example of food-processing industry, which has not been studied so far, and presents a scheduling method and some experimental results. This paper focuses on the problem of boiling process in a jam plant. The problem in this paper includes the constraint of perishability, which is a constraint when products are processed too much earlier than their due date, the values are going to reduce by reason of inferior quality, on the other hand, when the production is not in time for due date, the shortage of supply is going to happen. In the boiling process, setup time to change the kinds of products can be assumed as production bottleneck, so, it might be important to control setup operations for obtaining an effective management. To find a useful sequence to boil ingredients, a new management method is considered to minimize the deterioration in quality caused by the sum of earliness and tardiness. As basic study, this paper shows a general production line producing relatively small kinds of products in comparison with high-mix low-volume production line. In experiments, this paper mainly considers the possibility of variety of products corresponding to the production capacity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times

In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...

متن کامل

A Mathematical Programming Model for Flow Shop Scheduling Problems for Considering Just in Time Production

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

متن کامل

A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation

Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...

متن کامل

Bi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem

This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...

متن کامل

Particle swarm optimization for minimizing total earliness/tardiness costs of two-stage assembly flowshop scheduling problem in a batched delivery system

This paper considers a two-stage assembly flow shop scheduling problem. When all parts of each product are completed in the first stage, they are assembled into a final product on an assembly machine in the second stage. In order to reduce the delivery cost, completed products can be held until completion of some other products to be delivered in a same batch. The proposed problem addresses sch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011